Parallel Inference Machines (Panel)

نویسنده

  • Wolfgang Bibel
چکیده

The quest for ever more powerful computers has bumped up hard against the limits imposed by nature such as speed of light and electrons. However, scientists and industry agree that there is still a great potential for further speed-up by distributing computations among many processors rather than a single one. This is apparent for problems that can easily be broken down into many independent parts such as those to be tackled in graphics, signal processing (which includes radar, speech and vision analysis), structural analysis, fluid-flow dynamics, particle physics, and many others. First experiences with the new breed of parallel computers justify this optimism. It is less obvious whether a multi-processor would bring a significant improvement in performance for problems such as inferencing. Finding a correct chain of inferences requires searching through a space of different possible chains, a problem known to be hard (NP-complete) and requiring exponential recources in worst cases according to our present knowledge. Therefore one might argue that one thousand processors would provide relatively little improvement over a single one in worst (exponential) cases. From a more practical point of view, experiments seem to indicate that the possibilities for exploiting parallelism in rule-based systems might be rather limited. There are more problems of detail arising in an attempt to parallelize inferencing. The different possible chains in the search space partially coincide in a way not known at compile time hence making it difficult to break the whole task down into many parts and distribute these in a well-balanced way. Also (but not only) because of this overlap it seems attractive to exploit the parallelism inherent in each of these chains. But at present it is not clear at all whether this really pays since it might cause too much overhead in communication and anyway might have only a marginal effect in view of the more severe problem of NP-completeness mentioned above. Some even put forward reasonable arguments to the effect that inferencing in practice is not needed at all. Part of it could be substituted by exploiting database techniques even in the presence of recursion. Or, machine reasoning could be founded on episodes from the past stored in a massively parallel memory rather than on rules and facts thus leading to a memory-based reasoning with a parallelism radically different from the one discussed above; with this remark we scratch on the current discussion about connectionism. Much of …

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...

متن کامل

Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...

متن کامل

Multi-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints

This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...

متن کامل

Solving a New Multi-objective Unrelated Parallel Machines Scheduling Problem by Hybrid Teaching-learning Based Optimization

This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...

متن کامل

Flexible flowshop scheduling with equal number of unrelated parallel machines

This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...

متن کامل

A fixed and flexible maintenance operations planning optimization in a parallel batch machines manufacturing system

Scheduling has become an attractive area for artificial intelligence researchers. On other hand, in today's real-world manufacturing systems, the importance of an efficient maintenance schedule program cannot be ignored because it plays an important role in the success of manufacturing facilities. A maintenance program may be considered as the heath care of manufacturing machines and equipments...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1987